Multiobjective Optimization Genetic Algorithms for Domestic Airline Crew Pairing Problems

نویسندگان

  • Tung-Kuan Liu
  • Chiu-Hung Chen
  • Ta-Yuan Chou
  • Wen-Hsien Ho
  • Shinn-Horng Chen
  • Jyh-Horng Chou
چکیده

Airline crew pairing problems involve assigning the required crew members to each flight segment in a given time period, while complying with a variety of work regulations and collective agreements. Traditional researches formulate the pairing problems as integer programming problems, and use deterministic approaches to optimize the solutions. Such these approaches usually suffer from some critical issues such as time-consuming enumeration for possible pairings and difficulty to cover the whole search space. The goal of this paper is to develop a new multiobjective approach to solve the crew pairing problem by formulating it into multiobjective combination optimization equations and employing the inequality-based multiobjective genetic algorithm (MMGA) as the global optimization explorer. Besides, our experimental results for a real-world short-haul domestic airline show that the proposed approach can provide quite good pairing solutions.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Cockpit Crew Pairing Problem in Airline Scheduling: Shortest Path with Resources Constraints Approach

Increasing competition in the air transport market has intensified active airlines’ efforts to keep their market share by attaching due importance to cost management aimed at reduced final prices. Crew costs are second only to fuel costs on the cost list of airline companies. So, this paper attempts to investigate the cockpit crew pairing problem. The set partitioning problem has been used for ...

متن کامل

Optimization of Short-haul Airline Crew Pairing Problems Using a Multiobjective Genetic Algorithm

Airline crew pairing problems involve optimizing an overall evaluation function containing various conflicting objectives and constraints originating from cost and safety considerations. Classical approaches based on set partitioning or set covering methods separate the solution into two phases, pairing generation and pairing optimization, and evaluate the cost by a weighted-sum of objective va...

متن کامل

Iterative Airline Scheduling

In airline scheduling a variety of planning and operational decision problems have to be solved. We consider the problems aircraft routing and crew pairing: Aircraft and crew must be allocated to flights in a schedule in a minimal cost way. Although these problems are not independent, they are usually formulated as independent mathematical optimisation models and solved sequentially. This appro...

متن کامل

Crew Pairing Optimization with Genetic Algorithms

We present an algorithm for the crew pairing problem, an optimization problem that is part of the airline crew scheduling procedure. A pairing is a round trip starting and ending at the home base, which is susceptible to constraints that arise due to laws and regulations. The purpose of the crew pairing problem is to generate a set of pairings with minimal cost, covering all flight legs that th...

متن کامل

Or in Airline Industry or in Airline

Next to fuel costs, crew costs are the largest direct operating cost of airlines. Therefore much research has been devoted to the planning and scheduling of crews over the last thirty years. The planning and scheduling of crews is usually considered as two problems: the crew pairing problem and the crew assignment (rostering) problem. These problems are solved sequentially. In this paper we foc...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2010